A necessary and sufficient condition for a graph to be edge tenacious
نویسندگان
چکیده
منابع مشابه
A necessary and sufficient eigenvector condition for a connected graph to be bipartite
We give a necessary and sufficient condition for a graph to be bipartite in terms of an eigenvector corresponding to the largest eigenvalue of the adjacency matrix of the graph.
متن کاملA Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search
This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph. The consequences of this results are threefold: first, the condition is general enough to cover a broad range of practical graph matching problems; second, a proof to establish equivalence between gr...
متن کاملA necessary condition for a Shearlet system to be a frame via admissibility
Necessary conditions for shearlet and cone-adapted shearlet systems to be frames are presented with respect to the admissibility condition of generators.
متن کاملA Necessary and Sufficient Condition for Transcendency
As has been known for many years (see, e.g., K. Mahler, /. Reine Angew. Math., v. 166, 1932, pp. 118-150), a real or complex number f is transcendental if and only if the following condition is satisfied. To every positive number co there exists a positive integer n and an infinite sequence of distinct polynomials {p,(z)} = {pr + pr z + • • • + p z } at most of 0 1 n degree n with integral coef...
متن کاملA Necessary and Sufficient Condition for Peace∗
This paper examines the possibility for two contestants to agree on a peace settlement thereby avoiding a contest, in which each would exert a costly effort given the posterior distributions inferred from the negotiation. I find a necessary and sufficient condition of the prior distributions for there to exist a negotiation mechanism that admits a peace-ensuring perfect Bayesian equilibrium. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00400-3